#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

struct Node {
    int key;
    Node *prev, *next;
};

Node *nil;
void init() {
    nil = (Node *)malloc(sizeof(Node));
    nil->next = nil;
    nil->prev = nil;
}

void insert(const int &key) {
    Node *x = (Node *)malloc(sizeof (Node));
    x->key = key;
    x->next = nil->next;
    x->next->prev = x;
    nil->next = x;
    x->prev = nil;
}
void printList() {
    Node *cur = nil->next;
    int isf = 0;
    while (true) {
        if (cur == nil) break;
        if (isf++ > 0) printf(" ");
        printf("%d", cur->key);
        cur = cur->next;
    }
    printf("\n");
}
// 搜索含有key值的节点，返回其指针。
Node* listSearch(const int &key) {
    Node *cur = nil->next;
    while (cur != nil && cur->key != key) cur = cur->next;
    return cur;
}
// 删除节点元素
void deleteNode(Node *t) {
    if (t == nil) return;
    t->prev->next = t->next;
    t->next->prev = t->prev;
    free(t);
}
void deleteFirst() {
    deleteNode(nil->next);
}
void deleteLast() {
    deleteNode(nil->prev);
}
void deleteKey(const int &key) {
    deleteNode(listSearch(key));
}
int main() {
    int key, n, i;
    int size = 0;
    char com[20];
    int np = 0, nd = 0;
    scanf("%d", &n);
    init();
    for (i = 0; i < n; ++i) {
        scanf("%s%d", com, &key);
        if (com[0] == 'i') {
            insert(key);
            ++np;
            ++size;
        }
        else if (com[0] == 'd') {
            if (strlen(com) > 6) {
                if (com[6] == 'F') deleteFirst();
                else if (com[6] == 'L') deleteLast();
            } else {
                deleteKey(key); 
                ++nd;
            }
            --size;
        }
    }
    printList();
    return 0;
}
